Fast Filters for Two Dimensional String Matching Allowing Rotations
نویسندگان
چکیده
We give faster algorithms for searching a 2-dimensional pattern in a 2-dimensional text allowing rotations, mismatches and/or insertion/deletion errors.
منابع مشابه
A Rotation Invariant Filter for Two-Dimensional String Matching
We consider the problem of nding the occurrences of two{ dimensional pattern P1::m;1::m] in two{dimensional text T1::n; 1::n] when also rotations of P are allowed. A fast ltration{type algorithm is developed that nds in T the locations where a rotated P can occur. The corresponding rotations are also found. The algorithm rst reads from P a linear string of length m in all O(m 2) orientations th...
متن کاملExact and Approximate Two Dimensional Pattern Matching allowing Rotations
We give fast ltering algorithms for searching a 2{dimensional pattern in a 2{dimensional text allowing any rotation of the pattern. We consider the cases of exact and approximate matching under several matching models, improving the previous results. For a text of size n n character and a pattern of size m m characters, the exact matching takes average time O(n 2 =m). If we allow k{mismatches o...
متن کاملSequential and indexed two-dimensional combinatorial template matching allowing rotations
We present new and faster algorithms to search for a 2-dimensional pattern in a 2-dimensional text allowing any rotation of the pattern. This has applications such as image databases and computational biology. We consider the cases of exact and approximate matching under several matching models, using a combinatorial approach that generalizes string matching techniques. We focus on sequential a...
متن کاملA Rotation Invariant Filter for Two–dimensional String Matching1
We consider the problem of finding the occurrences of two– dimensional pattern P [1..m, 1..m] in two–dimensional text T [1..n, 1..n] when also rotations of P are allowed. A fast filtration–type algorithm is developed that finds in T the locations where a rotated P can occur. The corresponding rotations are also found. The algorithm first reads from P a linear string of length m in all O(m) orie...
متن کاملAn Index for Two Dimensional String Matching Allowing Rotations
We present an index to search a two-dimensional pattern of size m × m in a two-dimensional text of size n × n, even when the pattern appears rotated in the text. The index is based on (path compressed) tries. By using O(n) (i.e. linear) space the index can search the pattern in O((logσ n) ) time on average, where σ is the alphabet size. We also consider various schemes for approximate matching,...
متن کامل